Bounded Fixed Point Iteration

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fixed Point Iteration Method

We discuss the problem of finding approximate solutions of the equation 0 ) (  x f (1) In some cases it is possible to find the exact roots of the equation (1) for example when ) (x f is a quadratic on cubic polynomial otherwise, in general, is interested in finding approximate solutions using some numerical methods. Here, we will discuss a method called fixed point iteration method and a part...

متن کامل

Fixed Point Iteration with Inexact Function Values

In many iterative schemes, the precision of each step depends on the computational effort spent on that step. A method of specifying a suitable amount of computation at each step is described. The approach is adaptive and aimed at minimizing the overall computational cost subject to attaining a final iterate that satisfies a suitable error criterion. General and particular cost functions are co...

متن کامل

Fixed Point Iteration on Pointsymmetric Interference Graphs

Interference graphs are used for performance analysis of multiprocessor interconnection networks. In order to model blocked transmissions, nodes can have three states: idle, active or blocked. The resulting steady state probability distribution has a non-product form. Macro states are introduced to calculate performance measures, and the corresponding macro state probability distribution is app...

متن کامل

Solving time-fractional chemical engineering equations by modified variational iteration method as fixed point iteration method

The variational iteration method(VIM) was extended to find approximate solutions of fractional chemical engineering equations. The Lagrange multipliers of the VIM were not identified explicitly. In this paper we improve the VIM by using concept of fixed point iteration method. Then this method was implemented for solving system of the time fractional chemical engineering equations. The ob...

متن کامل

Bounded-Arity Hierarchies in Fixed-Point Logics

In this paper we prove that for each k, the expressive power of k–ary fixed–point logic, i.e. the fragment of fixed–point logic whose fixed–point operators are restricted to arity ≤ k, strictly exceeds the power of (k − 1)–ary fixed–point logic. This solves a problem that was posed by Chandra and Harel in 1982. Our proof has a rather general form that applies to several variants of fixed–point ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: DAIMI Report Series

سال: 1991

ISSN: 2245-9316,0105-8517

DOI: 10.7146/dpb.v20i359.6589